9 research outputs found
Integrability of graph combinatorics via random walks and heaps of dimers
We investigate the integrability of the discrete non-linear equation
governing the dependence on geodesic distance of planar graphs with inner
vertices of even valences. This equation follows from a bijection between
graphs and blossom trees and is expressed in terms of generating functions for
random walks. We construct explicitly an infinite set of conserved quantities
for this equation, also involving suitable combinations of random walk
generating functions. The proof of their conservation, i.e. their eventual
independence on the geodesic distance, relies on the connection between random
walks and heaps of dimers. The values of the conserved quantities are
identified with generating functions for graphs with fixed numbers of external
legs. Alternative equivalent choices for the set of conserved quantities are
also discussed and some applications are presented.Comment: 38 pages, 15 figures, uses epsf, lanlmac and hyperbasic
Confluence of geodesic paths and separating loops in large planar quadrangulations
We consider planar quadrangulations with three marked vertices and discuss
the geometry of triangles made of three geodesic paths joining them. We also
study the geometry of minimal separating loops, i.e. paths of minimal length
among all closed paths passing by one of the three vertices and separating the
two others in the quadrangulation. We concentrate on the universal scaling
limit of large quadrangulations, also known as the Brownian map, where pairs of
geodesic paths or minimal separating loops have common parts of non-zero
macroscopic length. This is the phenomenon of confluence, which distinguishes
the geometry of random quadrangulations from that of smooth surfaces. We
characterize the universal probability distribution for the lengths of these
common parts.Comment: 48 pages, 33 color figures. Final version, with one concluding
paragraph and one reference added, and several other small correction
Combinatorics of bicubic maps with hard particles
We present a purely combinatorial solution of the problem of enumerating
planar bicubic maps with hard particles. This is done by use of a bijection
with a particular class of blossom trees with particles, obtained by an
appropriate cutting of the maps. Although these trees have no simple local
characterization, we prove that their enumeration may be performed upon
introducing a larger class of "admissible" trees with possibly doubly-occupied
edges and summing them with appropriate signed weights. The proof relies on an
extension of the cutting procedure allowing for the presence on the maps of
special non-sectile edges. The admissible trees are characterized by simple
local rules, allowing eventually for an exact enumeration of planar bicubic
maps with hard particles. We also discuss generalizations for maps with
particles subject to more general exclusion rules and show how to re-derive the
enumeration of quartic maps with Ising spins in the present framework of
admissible trees. We finally comment on a possible interpretation in terms of
branching processes.Comment: 41 pages, 19 figures, tex, lanlmac, hyperbasics, epsf. Introduction
and discussion/conclusion extended, minor corrections, references adde
Loop models on random maps via nested loops: case of domain symmetry breaking and application to the Potts model
We use the nested loop approach to investigate loop models on random planar
maps where the domains delimited by the loops are given two alternating colors,
which can be assigned different local weights, hence allowing for an explicit
Z_2 domain symmetry breaking. Each loop receives a non local weight n, as well
as a local bending energy which controls loop turns. By a standard cluster
construction that we review, the Q = n^2 Potts model on general random maps is
mapped to a particular instance of this problem with domain-non-symmetric
weights. We derive in full generality a set of coupled functional relations for
a pair of generating series which encode the enumeration of loop configurations
on maps with a boundary of a given color, and solve it by extending well-known
complex analytic techniques. In the case where loops are fully-packed, we
analyze in details the phase diagram of the model and derive exact equations
for the position of its non-generic critical points. In particular, we
underline that the critical Potts model on general random maps is not self-dual
whenever Q \neq 1. In a model with domain-symmetric weights, we also show the
possibility of a spontaneous domain symmetry breaking driven by the bending
energy.Comment: 44 pages, 13 figure
Multicritical continuous random trees
We introduce generalizations of Aldous' Brownian Continuous Random Tree as
scaling limits for multicritical models of discrete trees. These discrete
models involve trees with fine-tuned vertex-dependent weights ensuring a k-th
root singularity in their generating function. The scaling limit involves
continuous trees with branching points of order up to k+1. We derive explicit
integral representations for the average profile of this k-th order
multicritical continuous random tree, as well as for its history distributions
measuring multi-point correlations. The latter distributions involve
non-positive universal weights at the branching points together with fractional
derivative couplings. We prove universality by rederiving the same results
within a purely continuous axiomatic approach based on the resolution of a set
of consistency relations for the multi-point correlations. The average profile
is shown to obey a fractional differential equation whose solution involves
hypergeometric functions and matches the integral formula of the discrete
approach.Comment: 34 pages, 12 figures, uses lanlmac, hyperbasics, eps